cant Lexical Relationships
نویسندگان
چکیده
Statistical NLP inevitably deals with a large number of rare events As a consequence NLP data often vio lates the assumptions implicit in traditional statistical procedures such as signi cance testing We describe a signi cance test an exact conditional test that is appropriate for NLP data and can be performed us ing freely available software We apply this test to the study of lexical relationships and demonstrate that the results obtained using this test are both theoretically more reliable and di erent from the results obtained using previously applied tests
منابع مشابه
Signi cant Lexical Relationships
We describe a test that can be used to accurately assess the significance of a population model from a data sample using freely available software. We apply this test to the study of lexical relationships and demonstrate that the results obtained using this test are both theoretically more reliable and diierent from the results obtained using previous approaches.
متن کاملThe eŒects of age-of-acquisition and frequency-of-occurrence in visual word recognition: Further evidence from the Dutch language
It has been claimed that the frequency eŒect in visual word naming is an artefact of age-of-acquisition: Words are named faster not because they are encountered more often in texts, but because they have been acquired earlier. In a series of experiments using immediate naming, lexical decision, and masked priming, we found that frequency had a clear eŒect in lexical tasks when age-of-acquisitio...
متن کاملComparing Lexical Relationships Observed within Japanese Collocation Data and Japanese Word Association Norms
While large-scale corpora and various corpus query tools have long been recognized as essential language resources, the value of word association norms as language resources has been largely overlooked. This paper conducts some initial comparisons of the lexical relationships observed within Japanese collocation data extracted from a large corpus using the Japanese language version of the Sketc...
متن کاملAutomatic generation of probabilistic relationships for improving schema matching
Schema matching is the problem of finding relationships among concepts across data sources that are heterogeneous in format and in structure. Starting from the ‘‘hidden meaning’’ associated with schema labels (i.e. class/attribute names), it is possible to discover lexical relationships among the elements of different schemata. In this work, we propose an automatic method aimed at discovering p...
متن کاملIdentifying Lexical Relationships and Entailments with Distributional Semantics
As the field of Natural Language Processing has developed, research has progressed on ambitious semantic tasks like Recognizing Textual Entailment (RTE). Systems that approach these tasks may perform sophisticated inference between sentences, but often depend heavily on lexical resources like WordNet to provide critical information about relationships and entailments between lexical items. Howe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996